BreakID: Static Symmetry Breaking for ASP (System Description)

نویسندگان

  • Jo Devriendt
  • Bart Bogaerts
چکیده

Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The result is a lightweight tool that can be plugged in between the grounding and the solving phases that are common when modelling in ASP. We compare our tool with sbass, the current stateof-the-art symmetry breaker for ASP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

نقش شکست تقارن بار در اختلاف انرژی بستگی هسته‌های آینه‌ای 15O-15N و 17F-17O

  Charge symmetry breaking potentials due to the exchange of pseudoscalar and vector mesons in mirror nuclei are considered. With the computation of coulmb energy along with the present charge symmetry breaking effects provide a reasonably accurate description of the binding energy differences between mirror nuclei.

متن کامل

Testing Object-Oriented Configurators With ASP

Testing is an important aspect of every software project. For configurator applications it is equally important but often neglected. This paper shows how to support testing object-oriented and constraint-based configurators by automatically generating positive and negative test cases using answer set programming (ASP). The object-model of the configurator is mapped to ASP code; the constraints ...

متن کامل

Model Restarts for Structural Symmetry Breaking

There exist various methods to break symmetries. The two that concern us in this paper are static symmetry breaking where we add static constraints to the problem (see e.g. [1,3]) and symmetry breaking by dominance detection (SBDD) where we filter values based on a symmetric dominance analysis when comparing the current searchnode with those that were previously expanded [2,5]. The core task of...

متن کامل

Dynamic Posting of Static Symmetry Breaking Constraints∗

We have proposed a method for dynamically posting symmetry breaking constraints to eliminate value interchangeability [1]. We now extend this method to work with any type of symmetry breaking constraint for any type of symmetry. We prove that this method is correct in general. That is, it only eliminates symmetric solutions. We also identify some simple conditions when it eliminates all symmetr...

متن کامل

Arities of Symmetry Breaking Constraints

Static symmetry breaking is a well-established technique to speed up the solving process of symmetric Constraint Satisfaction Programs (csps). Static symmetry breaking suffers from two inherent problems: symmetry breaking constraints come in great numbers and are of high arity. Here, we consider the problem of high arity. We prove that not even for binary csps can we always reduce the arity of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1608.08447  شماره 

صفحات  -

تاریخ انتشار 2016